An Incremental Interactive Algorithm for Regular Grammar Inference
نویسندگان
چکیده
We present provably correct interactive algorithms for learn ing regular grammars from positive examples and membership queries A structurally complete set of strings from a language L G corresponding to a target regular grammar G implicitly speci es a lattice of nite state automata FSA which contains a FSA MG corresponding to G The lattice is compactly represented as a version space and MG is identi ed by searching the version space using membership queries We explore the problem of regular grammar inference in a setting where positive exam ples are provided intermittently We provide an incremental version of the algorithm along with a set of su cient conditions for its convergence
منابع مشابه
Algorithm forRegular Grammar Inference ?
We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly speciies a lattice of nite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG...
متن کاملA Polynomial Time Incremental Algorithm for Regular Grammar Inference
We present an e cient incremental algorithm for learning regular grammars from labeled examples and membership queries. This algorithm is an extension of Angluin's ID procedure to an incremental framework. The learning algorithm is intermittently provided with labeled examples and has access to a knowledgeable teacher capable of answering membership queries. Based on the observed examples and t...
متن کاملA memetic grammar inference algorithm for language learning
An unsupervised incremental algorithm for grammar inference and its application to domain-specific language development are described. Grammatical inference is the process of learning a grammar from the set of positive and optionally negative sentences. Learning general context-free grammars is still considered a hard problem in machine learning and is not completely solved yet. The main contri...
متن کاملIncremental regular inference
In this paper, we extend the characterization of the search space of regular inference DMV94] to sequential presentations of learning data. We propose the RPNI2 algorithm, an incremental extension of the RPNI algorithm. We study the convergence and complexities of both algorithms from a theoretical and practical point of view. These results are assessed on the Feldman task.
متن کاملGenInc: An Incremental Context-Free Grammar Learning Algorithm for Domain-Specific Language Development
While grammar inference (or grammar induction) has found extensive application in the areas of robotics, computational biology, speech and pattern recognition, its application to problems in programming language and software engineering domains has been limited. We have found a new application area for grammar inference which intends to make domainspecific language development easier for domain...
متن کامل